Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
Given a vertex-weighted connected graphG = (V,E), the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree T of G such that the total weight of the internal vertices in T is maximized. The unweighted variant, denoted as MIST, is NPhard and APX-hard, and the currently best approximation algorithm has a proven performance ratio 13/17. The currently best approxi...
متن کاملAn approximation algorithm for maximum internal spanning tree
Given a graph G, the maximum internal spanning tree problem (MIST for short) asks for computing a spanning tree T of G such that the number of internal vertices in T is maximized. MIST has possible applications in the design of cost-efficient communication networks and water supply networks and hence has been extensively studied in the literature. MIST is NP-hard and hence a number of polynomia...
متن کاملA 2k-vertex Kernel for Maximum Internal Spanning Tree
We consider the parameterized version of the maximum internal spanning tree problem, which, given an n-vertex graph and a parameter k, asks for a spanning tree with at least k internal vertices. Fomin et al. [J. Comput. System Sci., 79:1–6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a 3k-vertex kernel. Here we propose a nove...
متن کاملA Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a new graph GR on at most 3k vertices and an integer k′ such that G has a spanning tree with at least k internal vertices if and only if GR has a spanning tree with at least k ′ internal vertices. In other words, we show that...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.11.003